Bond percolation critical probability bounds for three Archimedean lattices
نویسنده
چکیده
Rigorous bounds for the bond percolation critical probability are determined for three Archimedean lattices: .7385 < pc((3, 12 ) bond) < .7449, .6430 < pc((4, 6, 12) bond) < .7376, .6281 < pc((4, 8 ) bond) < .7201. Consequently, the bond percolation critical probability of the (3, 12) lattice is strictly larger than those of the other ten Archimedean lattices. Thus, the (3, 12) bond percolation critical probability is possibly the largest of any vertex-transitive graph with bond percolation critical probability that is strictly less than one.
منابع مشابه
Estimation of Bond Percolation Thresholds on the Archimedean Lattices
We give accurate estimates for the bond percolation critical probabilities on seven Archimedean lattices, for which the critical probabilities are unknown, using an algorithm of Newman and Ziff.
متن کاملRigorous bounds relating bond percolation thresholds of two three-dimensional lattices
A percolation model is an infinite random graph model for phase transitions and critical phenomena. The percolation threshold corresponds to a phase transition point, such as a melting or freezing temperature. The exact value of the percolation threshold is not known for any three-dimensional percolation models, which are important for physical applications. Furthermore, rigorous bounds for the...
متن کاملInclusions and non-inclusions of Archimedean and Laves lattices
For each pair of graphs from among the Archimedean lattices and their dual Laves lattices we demonstrate that one is a subgraph of the other or prove that neither can be a subgraph of the other. Therefore, we determine the entire partial ordering by inclusion of these 19 infinite periodic graphs. There are a total of 72 inclusion relationships, of which 35 are covering relations in the partial ...
متن کاملCritical Probabilities of 1-Independent Percolation Models
Given a locally finite connected infinite graph G, let the interval [pmin(G), pmax(G)] be the smallest interval such that if p > pmax(G) then every 1-independent bond percolation model on G with bond probability p percolates, and for p < pmin(G) none does. We determine this interval for trees in terms of the branching number of the tree. We also give some general bounds for other graphs G, in p...
متن کاملUniversal finite-size scaling functions for percolation on three-dimensional lattices
Using a histogram Monte Carlo simulation method ~HMCSM!, Hu, Lin, and Chen found that bond and site percolation models on planar lattices have universal finite-size scaling functions for the existence probability Ep , the percolation probability P , and the probability Wn for the appearance of n percolating clusters in these models. In this paper we extend above study to percolation on three-di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Random Struct. Algorithms
دوره 20 شماره
صفحات -
تاریخ انتشار 2002